Dynamic Local Scheduling of Multiple DAGs in Distributed Heterogeneous Systems

Heterogeneous computational platform offers a great ratio between the computational power and the price of the system. Static and dynamic scheduling methods offer a good way of how to use these systems efficiently and therefore many algorithms were proposed in the literature in past years. The aim of this article is to present the dynamic (on-line) algorithm which schedules multiple DAG applications without any central node and the schedule is created only with the knowledge of node’s network neigbourhood. The algorithm achieves great level of fairness for more DAGs and total computation time is close to the standard and well known competitors.